1249E - By Elevator or Stairs - CodeForces Solution

//jiudge: 21684: 1683628767
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
//#define int ll
typedef pair<int,int> pii;
const int N=2e5+7;
int n,m,dp[N][2],a[N],b[N];
void solve(){
	cin>>n>>m;
	for(int i=1;i<n;i++)cin>>a[i];
	for(int i=1;i<n;i++)cin>>b[i];
	dp[0][1]=100000;
	for(int i=1;i<n;i++){
		dp[i][0]=min(dp[i-1][0]+a[i],dp[i-1][1]+a[i]);
		dp[i][1]=min(dp[i-1][0]+b[i]+m,dp[i-1][1]+b[i]);
	}
	for(int i=0;i<n;i++)cout<<min(dp[i][0],dp[i][1])<<' ';
}
signed main(){
	int t=1;
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
//	cin>>t;
	while(t--)solve();
	return 0;
}